Disambiguation as (Defeasible) Reasoning about Underspecified Representations

نویسنده

  • Massimo Poesio
چکیده

UNDERSPECIFIED REPRESENTATIONS have been proposed as a way of formalizing sentence disambiguation in terms of (usually, nonmonotonic) reasoning. But in fact the existing theories about the semantics of underspecified representations either fail to capture our intuitions about ambiguity, or lead one to believe that the kind of inferences used in disambiguation have nothing to do with what we usually mean by inference. As a solution, I propose a theory of underspecification based on two hypotheses: that disambiguation is the task of recovering the content of the utterance events that take place in a discourse situation; and every utterance event that took place in a conversation, including utterances of single lexical items, is recorded in the common ground. The underspecified representations I propose are representations of what took place in the discourse situation, rather than directly about the content of an utterance. It is shown that the resulting theory of underspecification offers a more satisfactory account of lexical disambiguation and is more general that existing theories, in that can also be used to account for structural disambiguation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantic Ambiguity and Perceived Ambiguity

I explore some of the issues that arise when trying to establish a connection between the underspecification hypothesis pursued in the NLP literature and work on ambiguity in semantics and in the psychological literature. A theory of underspecification is developed ‘from the first principles’, i.e., starting from a definition of what it means for a sentence to be semantically ambiguous and from...

متن کامل

Completeness and Computational Efficiency for Underspecified Representations ∗

Cooper (1983) pioneered underspecified scope representation in formal and computational semantics through his introduction of quantifier storage into Montague semantics as an alternative to the syntactic operation of quantifying-in. In this paper we address an important issue in the development of an adequate formal theory of underspecified semantics. The tension between expressive power and co...

متن کامل

Disambiguation by Prioritized Circumscription

This paper presents a method of resolving ambiguity by using a variant of circumscription, prioritized circumscription. In a disambiguation task, human seems to use various preferences which have various strength. In prioritized circumscription, we can express these preferences as defeasible constraints with various strength and we infer the most preferable logical models which satisfy stronger...

متن کامل

Writing Weighted Constraints for Large Dependency Grammars

Implementing dependency grammar as a set of defeasible declarative rules has fundamental advantages such as expressiveness, automatic disambiguation, and robustness. Although an implementation and a successful large-scale grammar of German are available, so far the construction of constraint dependency grammars has not been described at length. We report on techniques that were used to write th...

متن کامل

Semantic Interpretation of Unrealized Syntactic Material in LTAG

This paper presents a LTAG-based analysis of gapping and VP ellipsis, which proposes that resolution of the elided material is part of a general disambiguation procedure, which is also responsible for resolution of underspecified representations of scope.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995